Orienting unorganized points for surface reconstruction
نویسندگان
چکیده
We address the problem of assigning consistently oriented normal vectors to unorganized point cloud with noises, non-uniformities, and thinsharp features as a pre-processing step to surface reconstruction. The conventional orienting scheme using minimal spanning tree fails on points with the above defects. Different from the recently developed consolidation technique, our approach does not modify (i.e., down-sampling) the given point cloud so that we can reconstruct more surface details in the regions with very few points. The method consists of three major steps. We first propose a modified scheme of generating adaptive spherical cover for unorganized points by adding a sphere splitting step based on eigenvalue analysis. This modification can better preserve the connectivity of surface generated from the spheres in the highly sparse region. After generating the triangular mesh surface and cleaning its topology, a local search based algorithm is conducted to find the closest triangle to every input points and then specify their orientations. Lastly, an orientation-aware principle component analysis step gives correct and consistently oriented normal vectors to the unorganized input points. Conventional implicit surface fitting based approach can successfully reconstruct high quality surfaces from the unorganized point cloud with the help of consistently oriented normal vectors generated by our method. Keywords—orientation; consistency; unorganized points; PCA; surface reconstruction.
منابع مشابه
The displaced subdivision surface reconstruction from unorganized points
In this paper we propose a new mesh reconstruction scheme that produces a displaced subdivision surface directly from unorganized points. The displaced subdivision surface is a new mesh representation that defines a detailed mesh with a displacement map over a smooth domain surface, but original displaced subdivision surface algorithm needs an explicit polygonal mesh since it is not a mesh reco...
متن کاملDirect Reconstruction of Displaced Subdivision Surface from Unorganized Points
In this paper we propose a new mesh reconstruction algorithm that produces a displaced subdivision mesh directly from unorganized points. The displaced subdivision surface is a new mesh representation that defines a detailed mesh with a displacement map over a smooth domain surface. This mesh representation has several benefits — compact mesh size, piecewise regular connectivity — to overcome l...
متن کاملShrink - Wrapped Boundary Face Algorithm for Mesh Reconstruction from Unorganized Points
Bon Ki Koo et al. 235 ABSTRACT⎯A new mesh reconstruction scheme for approximating a surface from a set of unorganized 3D points is proposed. The proposed method, called a shrink-wrapped boundary face (SWBF) algorithm, produces the final surface by iteratively shrinking the initial mesh generated from the definition of the boundary faces. SWBF surmounts the genus-0 spherical topology restriction...
متن کاملCurve and Surface Reconstruction from Regular and Non-Regular Point Sets
In this paper, we address the problem of curve and surface reconstruction from sets of points. We introduce regular interpolants which are polygonal approximations of planar curves and surfaces verifying a local sampling criterion. Properties of regular interpolants lead to new polygonal reconstruction methods from sets of organized and unorganized points. These methods do not need any paramete...
متن کاملDirect Reconstruction of a Displaced Subdivision Surface from Unorganized Points
In this paper we describe the generation of a displaced subdivision surface directly from a set of unorganized points. The displaced subdivision surface is an efficient mesh representation that defines a detailed mesh with a displacement map over a smooth domain surface, and has many benefits including compression, rendering, and animation, which overcome limitations of an irregular mesh produc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Graphics
دوره 34 شماره
صفحات -
تاریخ انتشار 2010